Oblivious two-way finite automata: Decidability and complexity
نویسندگان
چکیده
منابع مشابه
Size Complexity of Two-Way Finite Automata
This is a talk on the size complexity of two-way finite automata. We present the central open problem in the area, explain a motivation behind it, recall its early history, and introduce some of the concepts used in its study. We then sketch a possible future, describe a natural systematic way of pursuing it, and record some of the progress that has been achieved. We add little to what is alrea...
متن کاملTwo-way finite automata with restricted nondeterminism and descriptional complexity
Acknowledgements : many thanks to professor Giovanni Pighizzini for its welcome and for having directed my internship. Many thanks also to Carlo Mereghetti and Beatrice Palano and all organizing committee of NCMA workshop for having given me the possibility to assist at this workshop. Many thanks also to Viliam Geffert for his contribution to our work. Thanks to Antonio Capoduro for coffees and...
متن کاملComplementing Two-Way Finite Automata
We study the relationship between the sizes of two-way finite automata accepting a language and its complement. In the deterministic case, for a given automaton (2dfa) with n states, we build an automaton accepting the complement with at most 4n states, independently of the size of the input alphabet. Actually, we show a stronger result, by presenting an equivalent 4n-state 2dfa that always hal...
متن کاملFinite Automata With Restricted Two-Way Motion
We consider finite two-way automata and measure the use of twoway motion by counting the number of left moves in accepting computations. Restriction of the automata according to this measure allows us to study in detail the use of two-way motion for the acceptance of regular languages in terms of state complexity. The two-way spectrum of a given regular language is introduced. This quantity ref...
متن کاملA Simulation of Oblivious Multi-head One-way Finite Automata by Real-time Cellular Automata
In this paper, we present the simulation of a simple, yet significantly powerful, sequential model by cellular automata. The simulated model is called oblivious multi-head one-way finite automata and is characterised by having its heads moving only forward, on a trajectory that only depends on the length of the input. While the original finite automaton works in linear time, its corresponding c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2014
ISSN: 0890-5401
DOI: 10.1016/j.ic.2014.04.001